unsupervis trajectori sampl dwarehous visual olap analysi trajectori data ad dhoc olap trajectori data taco tunabl approxim comput outlier wireless sensor network gf dminer genet fuzzi classifi numer data geograph privaci dawar knowledg discoveri deliveri report summar event intern cluster trajectori move object uncertain world trajectori compress network constraint extend hash grid file famili linear hash set linear affin transform vector space finit field studi good class hash function hash set size rang cardin randomli chosen function expect size largest hash bucket univers class hash function finit field respect measur field behav differ finit field element bad set ae size expect maxim bucket size omega gamma perfect squar bad set largest bucket size worst respect univers class hash function set size expect largest bucket size field element bound previous upper bound primari index central knowledg sourc inform extract system dictionari linguist pattern identifi refer relev inform text automat creation conceptu dictionari import portabl scalabl system paper describ crystal system automat induc dictionari concept node definit suffici identifi relev inform train corpu concept node definit gener produc error minimum number dictionari entri cover posit train instanc test accuraci propos definit crystal surpass human intuit creat reliabl extract rule inform extract inform extract system analyz unrestrict natur languag text produc represent inform text whichi con dtree famili secondari index finit order alphabet string xn secondari index answer alphabet rang queri form rang al ar return set al ar xi al ar secondari index heavili relat databas scientif data analysi obviou solut store dictionari set xi posit set charact give optim queri time paper give theoret optim data structur secondari index problem model amount data read answer queri constant factor minimum space need repres set al ar assum size intern memori lg block constant gt space usag data structur lg bit worst case show bound size data structur term order entropi show support updat achiev time space trade off approxim version basic secondari index problem queri report superset al ar element al ar probabl gt fals posit probabl problem amount data read queri algorithm reduc al ar lg bit main idea work conceiv spatial index techniqu spatio dtempor trajectori tree dbase index convent databas manag system dbmss user effici access retriev data object multimedia databas manag system mmdbm emploi effect access method index hash paper survei treebas multidimension index techniqu mmdbmss maintain imag data repres featur vector techniqu support data maintain desir characterist btree index structur commonli tradit dbmss survei provid descript tree give exampl data organ scheme describ advantag disadvantag techniqu addit provid classif tree properti classif assist research identifi strength weak index techniqu develop user determin data structur applic panda framework compar pattern effect locat uncertainti spatial queri pattern similar scheme medic imag retriev pattern similar scheme medic imag retriev monitor pattern integr manag mine tool daedalu framework progress queri mine movement data pattern dminer integr manag mine data mine model pattern dminer integr manag mine data mine model build real dworld trajectori warehous cost model effici algorithm existenti uncertain spatial data gener framework estim similar dataset decis tree explor semant similar decis tree gener framework estim similar dataset decis tree explor semant similar decis tree compar dataset frequent itemset depend mine paramet herm aggreg lb trajectori db engin dtree dynam index structur spatial search trajectori data model propos parametr model pedestrian motion base gaussian process regress trajectori data model regress rel motion current posit show underli model learn unsupervis fashion demonstr databas collect static surveil camera exemplifi model predict compar recent propos gp bayesfilt mont carlo method illustr benefit approach long term motion predict parametr model kalman filter perform poorli trajectori databas system abstract paper describ effici index method shape base similar search trajectori dynam chang locat peopl mobil object order manag trajectori databas system defin data model trajectori direct line space similar trajectori defin euclidean distanc direct discret line propos similar queri find interest pattern embed trajectori trajectori mobil car citi includ pattern expect traffic jam propos effici index method retriev similar trajectori queri combin spatial index techniqu tree dimens reduct techniqu call paa piecewis approxim aggreg index method effici retriev trajectori shape space similar shape candid trajectori databas seismolog data wareh mine survei trajectori data warehous seismolog data wareh mine survei effect trajectori compress spatiotempor queri handl spatial vagu virtual agent control index dbase similar trajectori search problem trajectori similar move object databas topic spatial spatiotempor databas literatur exist work focus spatial notion similar ignor tempor dimens trajectori disregard presenc gener purpos spatiotempor index work address issu spatiotempor trajectori similar search defin similar metric propos effici approxim method reduc calcul cost develop metric heurist support similar trajectori search spatiotempor databas exploit exist treelik structur found support tradit queri experiment studi base real synthet dataset verifi propos similar metric effici retriev spatiotempor similar trajectori case relat work fail time propos algorithm shown effici highli scalabl mine trajectori databas suit distanc oper rapid progress mobil devic posit technolog trajectori databas td core databas research decad analysi knowledg discoveri td emerg field recent gain great interest extract knowledg td type mine techniqu cluster classif impos quantifi distanc trajectori main object support effect similar queri process exist approach util gener distanc metric ignor peculiar trajectori complex spatiotempor data type paper defin set trajectori distanc oper base primit space time deriv paramet trajectori speed direct aim provid power toolkit analyst requir produc distanc matric semant input mine task develop algorithm propos oper effici approach evalu experiment studi classif cluster task synthet real trajectori dataset similar search trajectori databas gener locat dbase servic effici algorithm distort block techniqu associ rule hide measur perform retail industri posit paper algorithm nearest neighbor search move object trajectori measur perform retail industri posit paper constrain subspac skylin comput paper introduc problem constrain subspac skylin queri class queri thought gener subspac skylin queri rang constraint constrain skylin queri subspac skylin queri address previous implic constrain subspac skylin queri examin constrain skylin queri expens regular skylin case constrain subspac skylin queri addit perform degrad caus project order support constrain skylin arbitrari subspac present approach exploit multipl low dimension index reli singl highdimension index effect prune strategi appli discard point domin region import ingredi approach workload adapt strategi determin number index assign dimens index extens perform evalu show superior propos techniqu compar relat competitor metaon ontolog driven metadata construct manag intellig search text imag collect herm framework locat dbase data manag abstract aim paper demonstr herm robust framework capabl aid spatio tempor databas develop model construct queri databas dynam object chang locat shape size discret continu time herm spatio tempor function state art object relat dbm ordbm prototyp design extens stau data manag infrastructur histor move object addition support demand real time dynam applic locat base servic lb produc type system packag provid data cartridg extens interfac oracl offspr framework extend pl sql spatio tempor semant servic result queri languag demonstr realiz queri propos benchmark framework evalu lb monic model monitor cluster transit discov commun social network data analyz commun evolut commun inher characterist human interact onlin social network paper citat network commun evolv time due individu role social statu network individu research interest present innov algorithm deviat tradit step approach analyz commun evolut tradit approach commun detect time slice compar determin correspond argu approach inappropri applic noisi data paper propos facetnet analyz commun evolut robust unifi boost locat dbase servic move object databas engin composit tempor spatial properti real world object unifi data framework result move object databas mod mod process manag analyz discret continu chang spatio tempor data paper present herm move data cartridg mod function opengi compat state theart object relat dbm herm design pure tempor pure spatial system main applic support model queri move object relev collect abstract data type adt oper defin develop provid data cartridg extend sql queri languag mod semant useful result queri languag demonstr develop applic top framework build visual result palett spatio tempor queri propos literatur advanc locat base servic lb benchmark framework evalu mod engin boost locat dbase servic move object databas engin composit tempor spatial properti real world object unifi data framework result move object databas mod mod process manag analyz discret continu chang spatio tempor data paper present herm move data cartridg mod function opengi compat state theart object relat dbm herm design pure tempor pure spatial system main applic support model queri move object relev collect abstract data type adt oper defin develop provid data cartridg extend sql queri languag mod semant useful result queri languag demonstr develop applic top framework build visual result palett spatio tempor queri propos literatur advanc locat base servic lb benchmark framework evalu mod engin index dbase densiti bias sampl cluster applic databas support data mine pattern abstract extract knowledg larg collect data led great develop data mine system techniqu result data mine pattern pattern found scientif area biologi astronomi mathemat todai requir impos system effici manipul complex divers pattern work studi problem effici represent storag pattern call pattern base manag system aim examin model databas domain relat object relat semi structur xml model altern model present compar base criteria gener extens queri effect comparison show semi structur represent pattern base nearest neighbor search move object trajectori abstract increas number mobil locat servic ml effect nn queri process histor trajectori data vehicl data analysi improv exist propos servic paper investig mechan perform nn search tree structur store histor inform move object trajectori propos branch bound algorithm vari respect type queri object stationari move point type queri result continu propos metric support search order prune strategi implement propos algorithm member tree famili trajectori data tbtree demonstr scalabl effici extens experiment studi synthet real dataset spatial join algorithm cost model optim techniqu fuzzi miner extract fuzzi rule numer pattern report intern workshop pattern represent manag parma proceed intl workshop pattern represent manag pattern manag challeng quantit qualit analysi block associ rule hide abstract data mine opportun extract inform larg databas techniqu propos context order extract inform effici effici concern studi secur privaci issu extract knowledg consid take consider studi procedur hide sensit associ rule binari data set block data valu present algorithm solv problem provid fuzzif support confid associ rule order accommod exist block unknown valu addit quantit compar propos algorithm publish algorithm run experi binari data set qualit compar effici propos algorithm hide associ rule util notion border rule put weight rule effect data structur represent rule minim side effect creat hide process speed select victim transact final discuss advantag limit block categori amp subject descriptor algorithm process dclosest dpair queri spatial databas paper address problem find closest pair spatial dataset socal closest pair queri cpq dataset store tree di erent techniqu solv kind distanc base queri techniqu increment approach return output element ascend order distanc nonincrement altern return element result end algorithm paper base distanc function mbr multidimension euclidean space propos prune heurist updat strategi minim prune distanc design increment branch bound algorithm cpq spatial object store tree approach recurs depth search strategi iter obei travers polici plane sweep method search order optim techniqu improv naiv approach number interest extens cpq cpq semi cpq fpq farthest pair queri discuss extens perform studi present studi base experi perform real dataset wide rang valu basic paramet ect perform algorithm examin order design cient algorithm set paramet valu final experiment studi behavior propos cpq branch bound algorithm term scalabl dataset size includ multi dwai distanc join queri spatial databas abstract tupl object obei queri graph qg call tupl ddistanc tupl linear function distanc object make tupl edg qg paper address problem find kn tupl spatial dataset smallest ddistancevalu call multi distanc join queri mwdjq set index tree base structur queri view extens closest pair queri cpq input addit recurs increment branch bound algorithm depth search process synchron input produc intermedi result propos enhanc prune techniqu appli tree node order reduc total respons time queri global lru buffer reduc number disk access final experiment studi propos algorithm real spatial dataset present keyword spatial databas distanc join queri tree perform studi state dof dthe dart privaci preserv data mine provid overview rapidli emerg research area privaci preserv data mine propos classif hierarchi set basi analyz work perform context detail review work accomplish area coordin work classif hierarchi evalu perform initi conclus made distanc join queri multipl input spatial databas abstract tupl object obei queri graph qg call tupl ddistanc tupl linear function distanc object make tupl edg qg paper address problem find kn tupl spatial dataset smallest ddistancevalu call multi distanc join queri mwdjq set index tree base structur queri view extens closest pair queri cpq input addit recurs increment branch bound algorithm depth search process synchron input produc intermedi result propos enhanc prune techniqu appli tree node order reduc total respons time queri global lru buffer reduc number disk access final experiment studi propos algorithm real spatial dataset present keyword spatial databas distanc join queri tree perform studi advanc spatial tempor databas present theori motion topolog point view symbol perspect take space time histori object primit entiti introduc tempor topolog relat defin space time character class spatial theori account qualit spatial inform deal underspecifi symbol inform accur data unnecessari show structur give basi commonsens spatio tempor reason present number signific deduct theori serv formal basi languag describ motion event qualit distanc join queri multipl input spatial databas abstract tupl object obei queri graph qg call tupl ddistanc tupl linear function distanc object make tupl edg qg paper address problem find kn tupl spatial dataset smallest ddistancevalu call multi distanc join queri mwdjq set index tree base structur queri view extens closest pair queri cpq input addit recurs increment branch bound algorithm depth search process synchron input produc intermedi result propos enhanc prune techniqu appli tree node order reduc total respons time queri global lru buffer reduc number disk access final experiment studi propos algorithm real spatial dataset present keyword spatial databas distanc join queri tree perform studi access method queri process techniqu abstract desir featur spatio tempor databas abil answer futur queri base current data characterist refer posit veloc vector move queri set move object futur queri ask set object satisfi queri time interv difficulti case queri data object chang posit continu reli fix refer posit determin answer exist techniqu base sampl repetit applic time parameter queri order provid answer paper develop effici method order process nearestneighbor queri move object databas basic advantag propos approach queri issu time interv time parameter tree structur index move object extens perform evalu base cpu time show signific improv achiev compar exist techniqu spatio dtempor databas year ahead ten benchmark databas queri locat dbase servic gener semant dbase trajectori move object domain spatiotempor applic treasur trove type data queri design test data type access method support applic larg spatiotempor dataset need case obtain real dataset exist access synthet dataset govern artifici paramet invis rule govern real world behavior work show case gener spatiotempor dataset simul real world behavior illustr case translat call gstd spatiotempor data gener gener data illustr dimension snapshot pictur dimension spatial tempor dimens trajectori imag synthet real spatiotempor dataset revisit dtree construct principl spatial index research field benefit comput scienc outstand result effort paper revisit outstand contribut spatial index question paradigm design access method global improv perform characterist argu dynam tree construct typic cluster problem address incorpor exist cluster algorithm work adopt mean algorithm studi effect relax split procedur propos multiwai split inher support cluster techniqu compar cluster approach promin exampl spatial access method tree effici effect algorithm densiti bias sampl paper descr densiti bias sampl algor exploit spatial index local densiti infor bh theyprycu pr vide impr ved qualiti samplingr esult fast access element dataset attain impr ved sampl qualiti rth ect factor skew nois dimension mor ver advantag cientli handl dynam updat rc low execut time thepr pose method examin expercu talli thecomparc rc illustr superub exist method keyword clusterc densiti bia sampl spatial index seismo dsurfer prototyp collect queri mine seismic data abstract earthquak phenomena constitut rich sourc inform year typic frequenc earthquak worldwid collect queri seismic data procedur local author order citizen inform special scientist seismologist physicist order studi phenomenon detail seismic data manag system meet requir impli natur seismic data kind data sole character alphanumer attribut spatial tempor dimens epicent time earthquak realiz visual area interest monitor seismic find hidden regular irregular assist understand region histor seismic profil essenti capabl system spatiotempor databas system set data analysi knowledg discoveri techniqu userfriendli visual interfac compos seismo surfer prototyp aim integr seismic data repositori www cluster base closest pair paper present cluster algorithm larg spatial databas exploit spatial access method determin closest pair extens present scalabl cluster larg databas cluster shape outlier due characterist propos algorithm attain advantag hierarch cluster graphtheoret algorithm provid effici qualiti cluster result superior verifi analyt experiment result constraint dbase process multiwai spatial join multiwai spatial join combin inform found spatial relat respect spatial predic motiv close correspond constraint satisfact problem csp show multiwai spatial join process systemat search algorithm tradition csp paper describ strategi window reduct synchron travers advantag underli spatial index prune search space effect addit provid cost model optim method combin strategi comput effici execut plan final evalu effici propos techniqu accuraci cost model extens experiment queri data combin kei word spatial databas spatial join constraint satisfact tree closest pair queri spatial databas paper address problem find closest pair spatial data set set store structur belong tree famili algorithm recurs iter present solv problem case closest pair treat special case extens studi base experi perform synthet real point data set present wide rang valu basic paramet affect perform algorithm effect overlap data set explor algorithm experiment comparison exist increment algorithm address problem present set algorithm propos outperform exist approach queri process move object trajectori effici cost model spatial queri dtree abstract select join queri fundament oper data base manag system dbm support nontradit data includ spatial object effici manner ongo interest databas research goal access method cost model spatial queri tool spatial queri process optim paper present analyt model estim cost term node disk access select join queri treebas structur propos formula knowledg underli tree structur applic uniform nonuniform data distribut addit experiment result present show accuraci analyt estim compar actual run synthet real data set index term spatial databas access method queri optim cost model tree gener spatiotempor dataset www effici storag index retriev time evolv spatial data task spatiotempor databas manag system stdbm support aim design index method access structur articl review gstd algorithm gener spatiotempor dataset user defin paramet introduc www base environ gener visual dataset gstd interfac main site http www cti gr gstd http www cs ualberta ca mn gstd advanc databas index current technolog perspect ec gi project process optim multiwai spatial join dtree import type queri process spatial databas geograph inform system spatial join oper select relat object pair satisfi spatial predic multiwai join combin data origin relat techniqu propos pairwis spatial join limit work focus multiwai spatial join process paper solv multiwai spatial join appli systemat search algorithm exploit tree effici guid search build temporari index materi intermedi result addit gener methodolog propos cost model optim algorithm evalu extens experiment gener spatiotempor dataset effici benchmark environ spatiotempor access method includ modul gener synthet dataset store dataset real dataset includ collect run access structur visual experiment result focus dataset repositori modul collect synthet data simul varieti real life scenario requir algorithm implement past gener static spatial point rectangular data instanc predefin distribut workspac introduc motion tempor evolut spatial object definit gener synthet data complex problem paper discuss paramet consid gener type data propos algorithm call gener spatio tempor data gstd gener set move point rectangular data follow extend set distri evalu access structur discret move point applic requir manag data spatial dynam track battl ship move cell blood sampl capabl handl tempor aspect histori type data import paper present evalu tempor extens tree tree tree hr tree capabl index spatiotempor data experi focu discret move point point stand specif locat time period move instantan explor paramet initi spatial distribut spatial queri area tempor queri length found hr tree outperform candid term queri process cost special queri time point small time interv main side effect hr tree storag requir whichismuch larger cost model join queri spatial databas join queri fundament oper data base manag system dbmss modern dbmss support tradit data includ spatial object effici manner goal spatial data structur adopt order support execut join queri set multidimension data paper introduc analyt model estim cost term node disk access join queri involv multidimension index data set tree base structur addit experiment result present show accuraci analyt estim compar actual run synthet real data set turn rel error rare exce combin fact make propos cost model tool effici spatial queri optim introduct spatial data base manag system sdbm offer data type queri specif effici index spatiotempor databas issu aris modern applic involv effici manipul static move spatial object relationship result modern databas system effici support type data goal extens multidimension access method exploit order index retriev spatiotempor object satisfi user demand paper introduc basic specif spatiotempor index structur follow evalu exist propos respect specif illustr issu interest involv object represent queri process index mainten direct relat ddimension rang queri optimis techniqu paper defin direct relat north northeast dimension object show effici retriev kdb tree base data structur essenti work studi optimis techniqu rang queri aris process direct relat test effici altern index method extens experiment present analyt model estim perform analyt estim shown close actual result spatial queri optim order predict retriev cost addit implement modif exist structur yield perform queri conclud paper discuss suitabl method depend type rang properti data keyword spatial databas direct relat index method perform analysi spatio dtempor composit index larg multimedia applic spatial relat minimum bound rectangl spatial data structur spatial relat import numer domain spatial queri languag imag multimedia databas reason geograph applic paper concern retriev topolog direct relat spatial data structur base minimum bound rectangl describ topolog direct relat region object studi spatial inform minimum bound rectangl convei actual object enclos appli result tree variat tree tree order minimis number disk access queri involv topolog direct relat investig queri express complex spatial condit form disjunct conjunct discuss extens point represent spatial object queri window extens techniqu spatial access method spatio dtempor index larg multimedia applic multimedia applic involv larg number multimedia object text imag sound spatial tempor relationship object effici support retriev multimedia author tool paper present spatial tempor spatio tempor relationship interest propos effici index scheme base multidimension spatial data structur larg multimedia applic involv thousand object evalu model propos scheme present hint select multimedia author requir introduct multimedia applic map involv varieti individu multimedia object present map scenario multimedia object particip map call actor transform spatial tempor order present author requir model predict dtree perform paper present analyt model predict perform tree variant rang queri answer cost model knowledg dataset propos formula estim number disk access function data properti amount data densiti work space word propos model applic construct tree index fact make tool dynam spatial databas experi synthet real dataset show propos analyt model accur rel error uniform uniform distribut error involv gap effici tree variant tree optimum implement method work extend previou research tree analysi constitut tool spatial queri optimiz model predict dtree perform paper present analyt model predict perform tree variant rang queri answer cost model knowledg dataset propos formula estim number disk access function data properti amount data densiti work space word propos model applic construct tree index fact make tool dynam spatial databas experi synthet real dataset show propos analyt model accur rel error uniform uniform distribut error involv gap effici tree variant tree optimum implement method work extend previou research tree analysi constitut tool spatial queri optimiz retriev direct relat dtree topolog relat world minimum bound rectangl studi dtree recent develop spatial relat led numer applic involv spatial databas paper concern retriev topolog relat minimum bound rectangl base data structur studi topolog inform minimum bound rectangl convei actual object enclos concept project appli result tree variat tree tree order minimis disk access queri involv topolog relat investig queri involv complex spatial condit form disjunct conjunct discuss extens retriev direct relat dtree optim issu dtree construct extend abstract construct effici tree structur account paramet optim coverag node dead area node overlap node exampl paramet exist access method combin paramet paper studi effect criteria perform tree structur propos combin complex respons tree construct introduct tree gutt direct extens tree dimens data structur height balanc tree consist intermedi leaf node descript data object store leaf node intermedi node built group rectangl lower level data object overlap cover complet disjoint assumpt made properti minimum bound rectangl mbr actual data object assum 